Four Stage Encryption Generalizations: Partitioned Output Cryptosystem
نویسندگان
چکیده
منابع مشابه
Four Stage Encryption Generalizations: Partitioned Output Cryptosystem
The Four Stage Encryption System introduced by Acharyulu and Appaji provides secrecy even when the attacker has some samples of plain texts and their corresponding cipher texts obtained with the same key, because the cipher text generated each time, for the same plain text with the same key, is different. In other words, the system is secure against adaptive chosen-plain text attack. Another in...
متن کاملGeneralizations of RSA Public Key Cryptosystem
In this paper, for given N = pq with p and q different odd primes, and m = 1, 2, · · · , we give a public key cryptosystem. When m = 1 the system is just the famous RSA system. And when m ≥ 2, the system is usually more secure than the one with m = 1.
متن کاملA Palmprint Based Cryptosystem using Double Encryption
The combination of cryptology and biometrics has emerged as promising component of information security. Despite the current popularity of palmprint biometric, there has not been any attempt to investigate its usage for the fuzzy vault. This paper therefore investigates the possible usage of palmprints in fuzzy vault to develop a user friendly and reliable crypto system. We suggest the use of b...
متن کاملEncryption Performance Improvements of the Paillier Cryptosystem
Homomorphic encryption methods provide a way to outsource computations to the cloud while protecting the confidentiality of the data. In order to deal with the large and growing data sets that are being processed nowadays, good encryption performance is an important step for practicality of homomorphic encryption methods. In this article, we study the encryption performance of the Paillier cryp...
متن کاملHomomorphic Encryption and the BGN Cryptosystem
• Gen(): Choose an elliptic curve E/Fp with a point P of prime order n, and an integer s R ← [1, n]. Output pk = (P,Q = [s]P ) and sk = s. • Enc(pk,M): Let pk = (P,Q) and interpret M as a point on E(Fp). Choose r R ← [1, n] and output C = ([r]P,M + [r]Q). • Dec(C, sk). Let sk = s and C = (C1, C2). Output M ′ = C2 − [s]C1. Suppose we have two messagesM,M ′ ∈ E(Fp) and we compute the encryptions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/19005-0507